A Fast Algorithm for Rational Interpolation Via Orthogonal Polynomials
نویسندگان
چکیده
A new algorithm for rational interpolation is proposed. Given the data set, the algorithm generates a set of orthogonal polynomials by the classical threeterm recurrence relation and then uses Newton interpolation to find the numerator and the denominator polynomials of the rational interpolating function. The number of arithmetic operations of the algorithm to find a particular rational interpolant is 0(N2), where N + 1 is the number of data points. A variant of this algorithm that avoids Newton interpolation can be used to construct all rational interpolants using only 0(N2) arithmetic operations.
منابع مشابه
Rational Interpolation at Chebyshev points
The Lanczos method and its variants can be used to solve eeciently the rational interpolation problem. In this paper we present a suitable fast modiication of a general look-ahed version of the Lanczos process in order to deal with polynomials expressed in the Chebyshev orthogonal basis. The proposed approach is particularly suited for rational interpolation at Chebyshev points, that is, at the...
متن کاملFast and Stable Rational Interpolation in Roots of Unity and Chebyshev Points
A new method for interpolation by rational functions of prescribed numerator and denominator degrees is presented. When the interpolation nodes are roots of unity or Chebyshev points, the algorithm is particularly simple and relies on discrete Fourier transform matrices, which results in a fast implementation using the Fast Fourier Transform. The method is generalised for arbitrary grids, which...
متن کاملA New Parallel Algorithm For Fast Generation of Discrete Chebyshev Polynomials
We present a new parallel algorithm for the fast generation of discrete Chebyshev polynomials. By fast we mean that the time complexity of the obtained parallel algorithm is of order O(logn), where n is the degree of the (n+1)st polynomial to be generated, and the number of available processors is assumed to be equal to a polynomial order of the input size. The parallel algorithm makes extensiv...
متن کاملOrthogonal polynomials: applications and computation
We give examples of problem areas in interpolation, approximation, and quadrature, that call for orthogonal polynomials not of the classical kind. We then discuss numerical methods of computing the respective Gauss-type quadrature rules and orthogonal polynomials. The basic task is to compute the coefficients in the three-term recurrence relation for the orthogonal polynomials. This can be done...
متن کاملOrthogonal Polynomials from Jacobi to Simon
4 Where do orthogonal polynomials come from? 10 Continued fractions . . . . . . . . . . . . . . . . . . . . . . . . . . 10 Padé approximation and rational interpolation . . . . . . . . . . 11 Moment problem . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 Jacobi matrices and spectral theory of self-adjoint operators . . . 13 Quadrature . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کامل